Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(g(x),s(0),y) |
→ f(g(s(0)),y,g(x)) |
| 2: |
|
g(s(x)) |
→ s(g(x)) |
| 3: |
|
g(0) |
→ 0 |
|
There are 3 dependency pairs:
|
| 4: |
|
F(g(x),s(0),y) |
→ F(g(s(0)),y,g(x)) |
| 5: |
|
F(g(x),s(0),y) |
→ G(s(0)) |
| 6: |
|
G(s(x)) |
→ G(x) |
|
The approximated dependency graph contains 2 SCCs:
{6}
and {4}.
-
Consider the SCC {6}.
There are no usable rules.
By taking the AF π with
π(G) = 1 together with
the lexicographic path order with
empty precedence,
rule 6
is strictly decreasing.
-
Consider the SCC {4}.
The usable rules are {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006